A Low-Complexity Sphere Decoding Algorithm for Generalized Spatial Modulation
نویسندگان
چکیده
منابع مشابه
Low Complexity Sphere Decoding for Spatial Multiplexing MIMO
In this paper we present a novel method for decoding multiple input multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance constant time modified sphere decoding algorithm. This algorithm was designed especially for large number of transmit antennas, and allows efficient implementation...
متن کاملLow Complexity Sphere Decoding for V-BLAST Spatial Multiplexing MIMO
With the tremendous growth in the field of communication, wireless system requires significantly higher spectral efficiency. The solution of this problem is MIMO Spatial Multiplexing (SM). In this paper we compare performance of different methods for decoding multiple input-multiple output (MIMO) transmission System incorporating VBLAST-SM, which includes sphere decoding (SD), zero forcing (ZF)...
متن کاملA New Low Computational Complexity Sphere Decoding Algorithm
The complexity of sphere decoding (SD) has been widely studied in that the algorithm is vital in providing the optimal Maximum Likelihood performance with low complexity. In this paper, we propose a proper tree search technique that reduces overall SD computational complexity without sacrificing performance. We build a check-table to pre-calculate and store some terms, temporally store some mid...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information and Communication Engineering
سال: 2016
ISSN: 2234-4772
DOI: 10.6109/jkiice.2016.20.1.30